package leetcode;

public class Leetcode33 {
    public int search(int[] nums, int target) {
        int left = 0;
        int right = nums.length-1;
        while(left<=right){
            int mid = left + (right-left)/2;
            if(nums[mid]==target){
                return mid;
            }
            if(nums[mid]>nums[left]){
                if(target>=nums[left]&&target<nums[mid]){
                    right = mid+1;
                }else{
                    left = mid - 1;
                }
            }else{
                if(target<=nums[right]&&target>nums[mid]){
                    right = mid+1;
                }else{
                    left = mid - 1;
                }
            }
        }
        return -1;
    }
}
